//输入一个链表的头节点，从尾到头反过来返回每个节点的值（用数组返回）。 
//
// 
//
// 示例 1： 
//
// 输入：head = [1,3,2]
//输出：[2,3,1] 
//
// 
//
// 限制： 
//
// 0 <= 链表长度 <= 10000 
// Related Topics 链表 
// 👍 43 👎 0

package leetcode.editor.cn;

import java.util.ArrayList;
import java.util.List;

//Java：从尾到头打印链表
public class PJzOffer06CongWeiDaoTouDaYinLianBiaoLcof{
    public static void main(String[] args) {
        Solution solution = new PJzOffer06CongWeiDaoTouDaYinLianBiaoLcof().new Solution();
//        solution.reversePrint();
        // TO TEST
    }
    //leetcode submit region begin(Prohibit modification and deletion)
/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    private List<Integer> list;
    public int[] reversePrint(ListNode head) {
        list=new ArrayList<Integer>();
        recur(head);
        int len=list.size();
        int[] res=new int[len];
        for(int i=0;i<len;i++){
            res[i]=list.get(i);
        }

        return  res;
    }

    public void recur(ListNode head){
        if(head==null){
            return;
        }
        recur(head.next);
        list.add(head.val);
    }
}
//leetcode submit region end(Prohibit modification and deletion)

}
